Automated synthesis of digital multiplexer networks - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

نویسندگان

  • A. E. A. Almaini
  • J. F. Miller
  • Xu
چکیده

A programmed algorithm is presented for the synthesis and optimisation of networks implemented with multiplexer universal logic modules. The algorithm attempts level by level optimisation selecting the control variables that result in minimum number of continuing branches. Cascaded networks, if realisable, are always found and given preference over tree networks, though mixtures of cascade and tree configurations are permitted. The algorithm is programmed in Fortran and tested for single and double control variable modules. In theory, the program can be used for any number of variables for completely and incompletely specified functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mapping single and multiple multilevel structures onto the hypercube - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

The paper introduces algorithms that map single and multiple multilevel structures onto the hypercube. For the case of the pyramid, which is a special multilevel structure, it is shown that a new algorithm is a compromise among existing algorithms with regard to cost and performance. Comparative analysis of the algorithms is carried out using analytical techniques and simulation results.

متن کامل

Analytic models for performance evaluation of single-buffered banyan networks under nonuniform traff - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

The performance of single-buffered banyan networks under certain nonuniform traffic patterns had been studied by Garg and Huang. However, the models used are over simplified and the results obtained may deviate from exact values significantly. Alternative models to achieve more accurate performance estimates are presented. In our models, the destinations of blocked packets residing in the buffe...

متن کامل

Tagged systolic arrays - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

Design of systolic arrays from a set of non-linear and nonuniform recurrence equations is discussed. A systematic method for deriving a systolic design in such cases is presented. A novel architectural idea, termed a tagged systolic array (TSA), is introduced. The design methodology described broadens the class of algorithms amenable for tagged systolic array implementation. The methodology is ...

متن کامل

Efficient state reduction methods for PLA-based sequential circuits - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

/ Abstract: Experiences with heuristics for the state reduction of finite-state machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implemention of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the...

متن کامل

Efficient state reduction methods for PLA-based sequential circuits - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE

/ Abstract: Experiences with heuristics for the state reduction of finite-state machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implemention of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008